منابع مشابه
GRASP for set packing problems
The principles of the Greedy Randomized Adaptative Search Procedure (GRASP) metaheuristic are instantiated for the set packing problem. We investigated several construction phases, and evaluated improvements based on advanced strategies. These improvements include a self-tuning procedure (using reactive GRASP), an intensification procedure (using path relinking) and a procedure involving the di...
متن کاملSet Covering, Packing and Partitioning Problems
where A is a mxn matrix of zeroes and ones, e = (1,...,1) is a vector of m ones and c is a vector of n (arbitrary) rational components. This pure 0-1 linear programming problem is called the set covering problem. When the inequalities are replaced by equations the problem is called the set partitioning problem, and when all of the ≥ constraints are replaced by ≤ constraints, the problem is call...
متن کاملGeneralized Set and Graph Packing Problems
Many complex systems that exist in nature and society can be expressed in terms of networks (e.g., social networks, communication networks, biological networks, Web graph, among others). Usually a node represents an entity while an edge represents an interaction between two entities. A community arises in a network when two or more entities have common interests, e.g., related proteins, industr...
متن کاملReactive GRASP for the strip-packing problem
This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite length so as to minimize the required length. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform ex...
متن کاملA Set-Covering-Based Heuristic Approach for Bin-Packing Problems
Several combinatorial optimization problems can be formulated as large size SetCovering Problems. In this work, we use the Set-Covering formulation to obtain a general heuristic algorithm for this type of problems, and describe our implementation of the algorithm for solving two variants of the well-known (One-Dimensional) Bin Packing Problem: the Two-Constraint Bin Packing Problem and the basi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2004
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(03)00263-7